Lectures on 0/1-Polytopes
نویسنده
چکیده
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an introduction and invitation. Rather than heading for an extensive survey on 0/1polytopes I present some interesting aspects of these objects; all of them are related to some quite recent work and progress. 0/1-polytopes have a very simple definition and explicit descriptions; we can enumerate and analyze small examples explicitly in the computer (e. g. using polymake). However, any intuition that is derived from the analysis of examples in “low dimensions” will miss the true complexity of 0/1-polytopes. Thus, in the following we will study several aspects of the complexity of higher-dimensional 0/1-polytopes: the doubly-exponential number of combinatorial types, the number of facets which can be huge, and the coefficients of defining inequalities which sometimes turn out to be extremely large. Some of the effects and results will be backed by proofs in the course of these lectures; we will also be able to verify some of them on explicit examples, which are accessible as a polymake database. ∗Supported by a DFG Gerhard-Hess-Forschungsförderungspreis (Zi 475/1-2) and by a German Israeli Foundation (G.I.F.) grant I-0309-146.06/93.
منابع مشابه
1 Residues formulae for volumes and Ehrhart polynomials of convex polytopes . Welleda Baldoni - Silva and Michèle Vergne January 2001
These notes on volumes and Ehrhart polynomials of convex polytopes are afterwards thoughts on lectures already delivered in Roma, by the second author in December 1999. The subject of these lectures was to explain Jeffrey-Kirwan residue formula for volumes of convex polytopes [J-K] and the residue formula for Ehrhart polynomials of rational polytopes [B-V 1, 2]. The main concept used in these f...
متن کاملLectures on Discrete and Polyhedral Geometry
1. The Helly theorem 11 2. Carathéodory and Bárány theorems 20 3. The Borsuk conjecture 26 4. Fair division 32 5. Inscribed and circumscribed polygons 39 6. Dyson and Kakutani theorems 54 7. Geometric inequalities 61 8. Combinatorics of convex polytopes 72 9. Center of mass, billiards and the variational principle 83 10. Geodesics and quasi-geodesics 96 11. The Steinitz theorem and its extensio...
متن کاملThe g - Theorem MA 715 Course Notes Spring 2002
These notes will be rather informal in many places. For more precision, refer to Lectures on Polytopes by Günter Ziegler [Zie95], Convex Polytopes by Branko Grünbaum [Grü67], An Introduction to Convex Polytopes by Arne Brøndsted [Brø83], and Convex Polytopes and the Upper Bound Conjecture by Peter McMullen and Geoffrey Shephard [MS71]. See also the handbook papers [BL93, KK95] We will be studyi...
متن کاملNP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes
In this paper, we discuss the adjacency structures of some classes of 0-1 polytopes including knapsack polytopes, set covering polytopes and 0-1 polytopes represented by complete sets of implicants. We show that for each class of 0-1 polytope, non-adjacency test problems are NP-complete. For equality constrained knapsack polytopes, we can solve adjacency test problems in pseudo polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000